United Nations Educational, Scientific and Cultural Organization and International Atomic Energy Agency THE ABDUS SALAM INTERNATIONAL CENTRE FOR THEORETICAL PHYSICS A LINEAR TIME ALGORITHM FOR FINDING THE CONVEX ROPES BETWEEN TWO VERTICES OF A SIMPLE POLYGON WITHOUT TRIANGULATION

نویسندگان

  • Phan Thanh An
  • Abdus Salam
چکیده

The convex rope problem, posed by Peshkin and Sanderson in IEEE J. Robotics Automat, 2 (1986) pp. 53-58, is to find the counterclockwise and clockwise convex ropes starting at the vertex a and ending at the vertex b of a simple polygon, where a is on the boundary of the convex hull of the polygon and b is visible from infinity. In this paper, we present a linear time algorithm for solving this problem without resorting to a linear-time triangulation algorithm and without resorting to a convex hull algorithm for the polygon. The counterclockwise (clockwise, respectively) convex rope consists of two polylines obtained in a basic incremental strategy described in convex hull algorithms for the polylines forming the polygon from a to b. MIRAMARE – TRIESTE June 2008 1 [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

United Nations Educational, Scientific and Cultural Organization and International Atomic Energy Agency THE ABDUS SALAM INTERNATIONAL CENTRE FOR THEORETICAL PHYSICS SOME RESULTS ON THE ASYMPTOTIC BEHAVIOUR OF HYPERBOLIC SINGULAR PERTURBATIONS PROBLEMS

Anisotropic singular perturbations of linear hyperbolic problems are considered. A description of the asymptotic behaviour of the solution as ε → 0 is given. In the case of cylindrical domains, we improve the rate of convergence in regions far from the lateral boundary.

متن کامل

United Nations Educational, Scientific and Cultural Organization and International Atomic Energy Agency THE ABDUS SALAM INTERNATIONAL CENTRE FOR THEORETICAL PHYSICS A NOTE ON CONVEX HULLS OF DIGITAL LINES AND DISCS

In this short note we provide two examples that elucidate certain structural properties of digital primitives used in computer graphics and image analysis and processing. In particular, we answer a question which was considered as an open one within the digital geometry community. MIRAMARE – TRIESTE August 2007 Regular Associate of ICTP.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008